Abductive Proofs as Models of Qualitative Reasoning
نویسندگان
چکیده
In this paper we describe an application of weighted abductive theorem proving that is used to create a model of students’ qualitative reasoning for the Why2-Atlas tutoring system. The system encourages a student to write an essay in natural language so that the essay provides both an explanation as well as an answer to a qualitative mechanics problem. The student’s essay is first mapped into a first-order predicate logic representation, which the abductive theorem prover treats as a goal (observation) in order to generate a proof that explains the essay. The resulting proof (1) provides an evaluation of the correctness of the student’s essay, and, in the event the essay contains errors, (2) provides a diagnosis of the observed errors that help identify possible tutoring actions. We describe the knowledge representation, rules and weighted abductive theorem proving framework, outline previous and upcoming evaluations, and discuss possible future directions.
منابع مشابه
Abductive Proofs as Models of Students' Reasoning about Qualitative Physics
In this paper we describe a part of the Why2-Atlas tutoring system that models students’ reasoning in the domain of qualitative physics. The main goals of the model are (1) to evaluate correctness of the student’s essay, and, in case the essay contains errors, (2) to direct remedial tutoring actions according to plausible errors in the student’s reasoning. To meet these goals, a backchaining th...
متن کاملNatural Language Understanding as First-Order Abduction via Stable Models
We present a method for finding abductive proofs in first-order Horn theories by using an answer-set solver. We illustrate our solution with examples from the domain of natural language understanding. Furthermore we describe a novel way of ranking abductive proofs of logical forms of sentences.
متن کاملUsing Abductive Recovery of Failed Proofs for Problem Solving by Analogy
We propose a solution to problem solving by analogy which is an alternative to Carbonell's transformational analogy. Given a plan that succeeds for the base, we apply the plan to the target and propose to correct its failures by an abductive recovery mechanism inspired from abductive recovery from failed proofs.
متن کاملDistributed abductive reasoning with constraints
Abductive reasoning is a powerful inference mechanism that can generate conditional proofs. The combination of Abduction and Logic Programming (ALP) [5] has many known applications, such as planning, scheduling, cognitive robotics, medical diagnosis and policy analysis [3]. However, most abductive frameworks [7, 4, 8] rely on a centrally executed proof procedure whereas many of the application ...
متن کاملDiscriminatively Reranking Abductive Proofs for Plan Recognition
We investigate the use of a simple, discriminative reranking approach to plan recognition in an abductive setting. In contrast to recent work, which attempts to model abductive plan recognition using various formalisms that integrate logic and graphical models (such as Markov Logic Networks or Bayesian Logic Programs), we instead advocate a simpler, more flexible approach in which plans found t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004